Computing, 8(1):21-42, 2002. [18] Stefan Ratschan. Quantified constraints under perturbations.
نویسندگان
چکیده
References [1] Dennis S. Arnon, George E. Collins, and Scott McCallum. Cylindrical algebraic decomposition I: The basic algorithm. SIAM Journal of Computing, 13(4):865–877, 1984. Also in [5]. [2] F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In International Symposium on Logic Programming, pages 124–138, Ithaca, NY, USA, 1994. MIT Press. [3] Frederic Benhamou and Frederic Goualard. Universally quantified interval constraints. In Proc. of the Sixth Intl. Conf. on Principles and Practice of Constraint Programming (CP’2000), number 1894 in LNCS, Singapore, 2000. Springer Verlag.
منابع مشابه
Quantified Constraints Under Perturbation
Quantified constraints (i.e., first-order formulae over the real numbers) are often exposed to perturbations: Constants that come from measurements usually are only known up to certain precision, and numerical methods only compute with approximations of real numbers. In this paper we study the behavior of quantified constraints under perturbation by showing that one can formulate the problem of...
متن کاملEstimating the Region of Attraction of Ordinary Differential Equations by Quantified Constraint Solving
We formulate the problem of estimating the region of attraction using quantified constraints and show how the resulting constraints can be solved using existing software packages. We discuss the advantages of the resulting method in detail.
متن کاملApplications of Quantified Constraint Solving over the Reals - Bibliography
Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is either unknown, or when it occurs in infinitely many, similar versions. The following is a list of application areas and publications that contain applications fo...
متن کاملEfficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall
In various applications the search for certificates for certain properties (e.g., stability of dynamical systems, program termination) can be formulated as a quantified constraint solving problem with quantifier prefix exists-forall. In this paper, we present an algorithm for solving a certain class of such problems based on interval techniques in combination with conservative linear programmin...
متن کاملSearch Heuristics for Box Decomposition Methods
In this paper we study search heuristics for box decomposition methods that solve problems such as global optimization, minimax optimization, or quantified constraint solving. For this we unify these methods under a branch-and-bound framework, and develop a model that is more convenient for studying heuristics for such algorithms than the traditional models from Artificial Intelligence. We use ...
متن کامل